Forward and Inverse Transformations Between Haar Spectra and Ordered Binary Decision Diagrams of Boolean Functions

نویسندگان

  • Bogdan J. Falkowski
  • Chip-Hong Chang
چکیده

Unnormalized Haar spectra and Ordered Binary Decision Diagrams (OBDDs) are two standard representations of Boolean functions used in logic design. In this article, mutual relationships between those two representations have been derived. The method of calculating the Haar spectrum from OBDD has been presented. The decomposition of the Haar spectrum, in terms of the cofactors of Boolean functions, has been introduced. Based on the above decomposition, another method to synthesize OBDD directly from the Haar spectrum has been presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Haar Spectral Representations and Their Applications

Haar transform is known to have the smallest computational requirement and has been used mainly for pattern recognition and image processing. Although the properties of Haar spectra of Boolean functions have considerable interest and attraction, the majority of publications to date have employed the Walsh rather than Haar transform in their considerations. It is mainly due to the fact that up t...

متن کامل

Ordered Binary Decision Diagrams and Minimal Trellises John La erty

Ordered binary decision diagrams (OBDDs) are graph-based data structures for representing Boolean functions. They have found widespread use in computer-aided design and in formal veri cation of digital circuits. Minimal trellises are graphical representations of error-correcting codes that play a prominent role in coding theory. This paper establishes a close connection between these two graphi...

متن کامل

Ordered Binary Decision Diagrams and Minimal Trellises

Ordered binary decision diagrams (OBDDs) are graph-based data structures for representing Boolean functions. They have found widespread use in computer-aided design and in formal veriication of digital circuits. Minimal trellises are graphical representations of error-correcting codes that play a prominent role in coding theory. This paper establishes a close connection between these two graphi...

متن کامل

Function-driven Linearly Independent Expansions of Boolean Functions

The paper presents a family of new expansions of Boolean functions called Function-driven Linearly Independent (fLI) expansions. On the basis of this expansion a new kind of a canonical representation of Boolean functions is constructed: Function-driven Linearly Independent Binary Decision Diagrams (fLIBDDs). They generalize both Function-driven Shannon Binary Decision Diagrams (fShBDDs) and Li...

متن کامل

Diierential Bdds ?

In this paper, we introduce a class of Binary Decision Diagrams (BDDs) which we call Differential BDDs ( BDDs), and two transformations over BDDs, called Push-up (") and Delta ( ) transformations. In BDDs and its derived classes such as " BDDs or " BDDs, in addition to the ordinary node-sharing in the normal Ordered Binary Decision Diagrams (OBDDs), some isomorphic substructures are collapsed t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 46  شماره 

صفحات  -

تاریخ انتشار 1997